On the finite size corrections to some random matching problems
نویسنده
چکیده
We get back to the computation of the leading finite size corrections to some random link matching problems, first adressed by Mézard and Parisi [J. Physique 48 (1987) 1451-1459]. In the so-called bipartite case, their result is in contradiction with subsequent works. We show that they made some mistakes, and correcting them, we get the expected result. In the non bipartite case, we agree with their result but push the analytical treatment further.
منابع مشابه
A Semi-Analytical Method for History Matching and Improving Geological Models of Layered Reservoirs: CGM Analytical Method
History matching is used to constrain flow simulations and reduce uncertainty in forecasts. In this work, we revisited some fundamental engineering tools for predicting waterflooding behavior to better understand the flaws in our simulation and thus find some models which are more accurate with better matching. The Craig-Geffen-Morse (CGM) analytical method was used to predict recovery performa...
متن کاملOn the solution of the random link matching problems
2014 We show that the replica symmetric solution of the matching problem (bipartite or not) with independent random distances is stable. We compute the fluctuations and get the O (1/N) corrections to the length of the optimal matching in a generic sample. J. Physique 48 (1987) 1451-1459 SEPTEMBRE 1987, Classification Physics Abstracts 02.10+W 64.40 Cn 75.10 Nr
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملVariational Calculations for the Relativistic Interacting Fermion System at Finite Temperature: Application to Liquid 3He
In this paper, at first we have formulated the lowest order constrained variational method for the relativistic case of an interacting fermion system at finite temperature. Then we have used this formalism to calculate some thermodynamic properties of liquid in the relativistic regime. The results show that the difference between total energies of relativistic and non-relativistic cases of liqu...
متن کاملA Highly Parallel Finite State Automaton Processor for Biological Pattern Matching
Finite State Automata are useful for string searching problems mostly because they are fast. For very large problems, a software implementation will not be fast enough. I describe here a parallel implementation of a hardware Deterministic Finite State Automaton processor. It can rapidly search a large database for approximately matching strings, as a lter for more detailed processing later. As ...
متن کامل